A reliable and resource aware framework for data dissemination in wireless sensor networks

Distinctive from traditional wireless ad hoc networks, wireless sensor networks (WSN) comprise a large number of low-cost miniaturized nodes each acting autonomously and equipped with short-range wireless communication mechanism, limited memory, processing power, and a physical sensing capability. Since sensor networks are resource constrained in terms of power, bandwidth and computational capability, an optimal system design radically changes the performance of the sensor network. Here, a comprehensive information dissemination scheme for wireless sensor networks is performed. Two main research issues are considered: (1) a collaborative flow of information packet/s from the source to sink and (2) energy efficiency of the sensor nodes and the entire system. For the first issue, we designed and evaluated a reactive and on-demand routing paradigm for distributed sensing applications. We name this scheme as IDLF-Information Dissemination via Label ForwarDing IDLF incorporates point to point data transmission where the source initiates the routing scheme and disseminates the information toward the sink (destination) node. Prior to transmission of actual data packet/s, a data tunnel is formed followed by the source node issuing small label information to its neighbors locally. These labels are in turn disseminated in the network. By using small size labels, IDLF avoids generation of unnecessary network traffic and transmission of duplicate packets to nodes. To study the impact of node failures and to improve the reliability of the network, we developed another scheme which is an extension to IDLF. This new scheme, RM-IDLF - Reliable Multipath Information dissemination by Label Forwarding, employ an alternate disjoint path. This alternate path scheme (RM-IDLF) may have a higher path cost in terms of energy consumption, but is more reliable in terms of data packet delivery to sink than the single path scheme (IDLF). In the latter scheme, the protocol establishes multiple (alternate) disjoint path/s from source to destination with negligible control overhead to balance load due to heavy data traffic among intermediate nodes from source to the destination. Another point of interest in this framework is the study of trade-offs between the achieved routing reliability using multiple disjoint path routing and extra energy consumption due to the use of additional path/s. Also, the effect of the failed nodes on the network performance is evaluated within the sensor system; Performance of the label dissemination scheme is evaluated and compared with the classic flooding and SPIN. (Abstract shortened by UMI.)

Loop detection and prevention mechanism in multiprotocol label switching

The extended color thread algorithm is based on running a thread hop by hop before the labels are distributed inside a MPLS Cloud Since the path for the data packets is set beforehand, the loop formation occurs at the control path. The shortest paths between selected source and destination have been calculated using Dijkstra\u27s shortest path algorithm and threads are allowed to extend through the routers. With the passage of each next hop, a distributed procedure is executed within the thread, generating a unique color at nodes. This keeps a track on router\u27s control path and at the same time ensures that no loop formation occurs. In loop prevention mode, a router transmits a label mapping, when it rewinds the thread for that particular LSP. Likewise, if a router operates in loop detection mode, it returns a label-mapping message without a thread object, after receiving a colored thread. The scheme is a loop prevention scheme, thus, ensuring loop detection and loop mitigation. The same algorithm is then extended to a proposed MPLS environment with global label space. (Abstract shortened by UMI.)

Reliable Data Transmission in Mobile Ad Hoc Sensor networks

In this paper, we introduce a new routing scheme for mobile ad hoc sensor networks, which effectively transports the information from source to sink by curbing the energy requirements, both at node and system level. The proposed approach, termed as Reliable Multipath-Information Dissemination via Label Forwarding (RM-IDLF), is both resource awareness and data centric. We integrate the power economics by using the local information within a sensor cloud and coordinating with the neighbouring nodes to disseminate the information. The nodes carrying the information over the decentralised network use metadata descriptors in the form of \u27label\u27, which communicates with other nodes. Actual information is then seeped through the path generated by trading labels. We study the performance of RM-IDLF for different node densities under faulty nodes to study the reliability and compare it with the current data dissemination routing schemes. We evaluate RM-IDLF over a C++ simulator. The experimental analyses show that we can save significant amount of energy as compared to the prior methods

Comprehensive Study of Routing Management in Wireless Sensor Networks- Part-1

Increasing computing and wireless communication capabilities will expand the role of the sensors from mere information dissemination to more demanding tasks as sensor fusion, classification, collaborative target tracking. Wireless sensor nodes can be mobile within a chosen area and communicate with neighboring nodes in the bounds of protocol limits. Typically they are densely deployed in large numbers and are prone to failures, and frequent topology changes. Among many concerns about design of sensor networks are growing bandwidth demands, speed of information retrieval and transporting bytes over the wireless networks to provide a quality service for the diverse requirements of the users, such as signal processing or multimedia applications. This Paper has been split in two parts to discuss past and ongoing research in routing schemes in WSNs. Current work a comprehensive investigation of different routing schemes used in wireless sensor networks. Depending on the sensor applications, the design challenge, advantage and performance concern for each routing protocols is also revealed. 1

Data Dissemination with Resource Management in Wireless Sensor networks

Wireless sensor nodes can be mobile within a chosen area and communicate with neighboring nodes in the bounds of protocol limits. Since communications among all network components in sensor networks are wireless, a peer-to-peer protocol is employed between two nodes. Among many concerns about design of sensor networks are growing bandwidth demands, speed of information retrieval and transporting bytes over the wireless networks to provide a quality service for the diverse requirements of the users, such as signal processing or multimedia applications. Although traditional routing protocols ignore power management issues for sensor networks, design and implementation of an efficient energy based routing is in the core interest. In this paper, we discuss the current power management protocols, and propose an energy restrained information dissemination scheme. Experimental analysis and comparison with related work show that using the proposed scheme we can save substantial energy as compared to the prior methods

Energy-Efficient Routing in Wireless Sensor Networks based on Data Reduction

A simple technique is presented to reduce power consumption in wireless sensor networks. This technique is based on reducing data size and sending smaller size packets which will in turn result in power savings. Target applications are assumed to involve environments where variations in data are typically continuous in time. Experimental analyses show that the energy saving can be up to 50 % if the proposed technique is employed. Further, energy saving grows linearly with the number of hops between the source and sink nodes. In a sensor network tiny sensor nodes have a capability to sense and process sensed data, and perform communication among them [1, 2]. Typically these nodes are deployed in a large sensor field. Each node in a sensor network plays the dual role of a data originator and data router. Sensor nodes are prone to failure, and therefore the sensor network topology changes frequently. If a few nodes die, this may caus

Loop Detection in MPLS for Wireless Sensor networks

Very few technologies illustrate the fast rate of technological innovations more than wireless sensor networks. Sensor networks offer a virtual path capability to carry differentiated services efficiently across the wireless backbone. In this paper, we provide a new efficient strategy for loop detection in Multi-protocol Label Switching (MPLS) for wireless networks—MPLS is a novel wireless networking topology that can be used to provide differentiated service, traffic engineering and quality of service in wireless networks